Performance Analysis of Raptor Codes under Maximum-Likelihood (ML) Decoding

نویسندگان

  • Peng Wang
  • Guoqiang Mao
  • Zihuai Lin
  • Ming Ding
  • Weifa Liang
  • Xiaohu Ge
  • Zhiyun Lin
چکیده

Raptor codes have been widely used in many multimedia broadcast/multicast applications. However, our understanding of Raptor codes is still incomplete due to the insufficient amount of theoretical work on the performance analysis of Raptor codes, particularly under maximum-likelihood (ML) decoding, which provides an optimal benchmark on the system performance for the other decoding schemes to compare against. For the first time, this paper provides an upper bound and a lower bound, on the packet error performance of Raptor codes under ML decoding, which is measured by the probability that all source packets can be successfully decoded by a receiver with a given number of successfully received coded packets. Simulations are conducted to validate the accuracy of the analysis. More specifically, Raptor codes with different degree distribution and pre-coders, are evaluated using the derived bounds with high accuracy. Peng Wang is with the School of Electrical and Information Engineering, The University of Sydney, Australia and National ICT Australia (NICTA) Sydney (e-mail: [email protected]). Guoqiang Mao is with the School of Computing and Communication, The University of Technology Sydney, Australia and National ICT Australia (NICTA) Sydney (e-mail: [email protected]). Zihuai Lin is with the School of Electrical and Information Engineering, The University of Sydney, Australia (e-mail: [email protected]). Ming Ding is with the National ICT Australia (NICTA) (e-mail: [email protected]). Weifa Liang is with the Research School of Computer Science, The Australian National University, Australia (e-mail: [email protected]). Xiaohu Ge is with the School of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, Hubei, China (email: [email protected]). Zhiyun Lin is with the College of Electrical Engineering, Zhejiang University, China (email: [email protected]). This article has been submitted to IEEE Transactions on Communication. Submission information: TCOM-TPS-15-0052. January 30, 2015 DRAFT Index Terms Raptor codes; asymptotic analysis; maximum-likelihood (ML) decoding; decoding success probability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achieving a near-optimum erasure correction performance with low-complexity LDPC codes

SUMMARY Low-density parity-check (LDPC) codes are shown to tightly approach the performance of idealized maximum distance separable (MDS) codes over memoryless erasure channels, under maximum likelihood (ML) decoding. This is possible down to low error rates and even for small and moderate block sizes. The decoding complexity of ML decoding is kept low thanks to a class of decoding algorithms, ...

متن کامل

Fountain Codes under Maximum Likelihood Decoding

This dissertation focuses on fountain codes under maximum likelihood (ML) decoding. Fountain codes are a class of erasure correcting codes that can generate an endless amount of coded symbols and were conceived to deliver data files over data networks to a potentially large population of users. First Luby transform (LT) codes are considered, which represent the first class of practical fountain...

متن کامل

On-the-Fly Maximum-Likelihood Decoding of Raptor Codes over the Binary Erasure Channel

In this letter, we propose an efficient on-the-fly algorithm for maximum-likelihood decoding of Raptor codes used over the binary erasure channel. It is shown that our proposed decoding algorithm can reduce the actual elapsed decoding time by more than two-thirds with respect to an optimized conventional maximum-likelihood decoding. key words: raptor codes, on-the-fly decoding, maximum-likeliho...

متن کامل

Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial

This article is focused on the performance evaluation of linear codes under maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, the analysis of linear codes under ML decoding allows to predict their performance without resorting to computer simulations. In this article, upper and lower bounds on the error probability of linear co...

متن کامل

Design and optimization of AL-FEC codes: the GLDPC-Staircase codes. (Conception et optimisation de codes AL-FEC : les codes GLDPC- Staircase)

This work is dedicated to the design, analysis and optimization of Application-Level Forward Erasure Correction (AL-FEC) codes. In particular, we explore a class of Generalized LDPC (GLDPC) codes, named GLDPC-Staircase codes, involving the LDPCStaircase code (base code) as well as Reed-Solomon (RS) codes (outer codes). In the first part of this thesis, we start by showing that RS codes having “...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015